Enumerative properties of shifted-Dyck partitions
نویسندگان
چکیده
منابع مشابه
Pairs of noncrossing free Dyck paths and noncrossing partitions
Using the bijection between partitions and vacillating tableaux, we establish a correspondence between pairs of noncrossing free Dyck paths of length 2n and noncrossing partitions of [2n + 1] with n + 1 blocks. In terms of the number of up steps at odd positions, we find a characterization of Dyck paths constructed from pairs of noncrossing free Dyck paths by using the Labelle merging algorithm.
متن کاملKazhdan-lusztig and R-polynomials, Young’s Lattice, and Dyck Partitions
We give explicit combinatorial product formulas for the maximal parabolic Kazhdan-Lusztig and R-polynomials of the symmetric group. These formulas imply that these polynomials are combinatorial invariants, and that the KazhdanLusztig ones are nonnegative. The combinatorial formulas are most naturally stated in terms of Young’s lattice, and the one for the Kazhdan-Lusztig polynomials depends on ...
متن کاملEnumerative properties of generalized associahedra
Some enumerative aspects of the fans called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras, are considered in relation with a bicomplex and its two spectral sequences. A precise enumerative relation with the lattices of generalized noncrossing partitions is conjectured and some evidence is given.
متن کاملGenerating functions for shifted plane partitions
With the help of a tableaux method, determinant formulas for trace generating functions for various classes of shifted plane partitions are derived. Proceeding from these determinants, generalizations of Gansner's (J. hook formulas for shifted plane partitions and alternative proofs of recent results of Proctor about alternating trace generating functions are given.
متن کاملEnumerative Properties of Ferrers Graphs
We define a class of bipartite graphs that correspond naturally with Ferrers diagrams. We give expressions for the number of spanning trees, the number of Hamiltonian paths when applicable, the chromatic polynomial and the chromatic symmetric function. We show that the linear coefficient of the chromatic polynomial is given by the excedance set statistic.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2010
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2009.05.004